Primal—Dual Methods for Vertex and Facet Enumeration
نویسندگان
چکیده
منابع مشابه
Comparative computational results for some vertex and facet enumeration codes
We report some computational results comparing parallel and sequential codes for vertex/facet enumeration problems for convex polyhedra. The problems chosen span the range from simple to highly degenerate polytopes. We tested one code (lrs) based on pivoting and four codes (cddr+, ppl , normaliz , porta) based on the double description method. normaliz employs parallelization as do the codes pl...
متن کامل0/1 Vertex and Facet Enumeration with BDDs
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Another one is the convex hull problem: Given a set of 0/1 points in dimension d, enumerate the facets of the corresponding polytope. We present two new approaches for both problems. The novelty of our algorithms is the in...
متن کاملmplrs: A scalable parallel vertex/facet enumeration code
We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of computers. The implementation makes use of a C wrapper that essentially uses the existing lrs code with only minor modifications. mplrs was derived from the earlier parallel implementation plrs, written by G. Roumanis in C++. plrs uses the Bo...
متن کاملTopological finiteness for edge-vertex enumeration
The number of PL-homeomorphism types of combinatorial manifolds in a fixed dimension with an upper bound on g2 is finite. At the intersection of topological and enumerative combinatorics is the relationship between the f -vector of simplicial complex and its topology. The Euler-Poincaré formula is perhaps the oldest such result. More recently, the complete characterization of all possible f -ve...
متن کاملVertex-Facet Incidences of Unbounded Polyhedra
How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is bounded. In the case of a polyhedron that is simple and “simplicial,” i.e., a d-dimensional polyhedron that has d facets through each vertex and d vertices on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1998
ISSN: 0179-5376
DOI: 10.1007/pl00009389